A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
نویسندگان
چکیده
منابع مشابه
A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
We propose a probabilistic algorithm for factorization of an integer N with run time (exp^log/V loglogJV)/5/4"1""'1'. Asymptotically, our algorithm will be as fast as the wellknown factorization algorithm of Morrison and Brillhart. The latter algorithm will fail in several cases and heuristic assumptions are needed for its run time analysis. Our new algorithm will be analyzed under the assumpti...
متن کاملA New Factorization Technique Using Quadratic Forms
The paper presents a practical method for factoring an arbitrary N by representing N or \N by one of at most three quadratic forms: XAf = s2 — Dy2, X = 1, — 1, 2, D = — 1, ±2, ±3, ±6. These three forms appropriate to N, together with inequalities for y, are given for all N prime to 6. Presently available sieving facilities make the method quite effective and economical for numbers N having 20 t...
متن کاملApplications of quadratic D-forms to generalized quadratic forms
In this paper, we study generalized quadratic forms over a division algebra with involution of the first kind in characteristic two. For this, we associate to every generalized quadratic from a quadratic form on its underlying vector space. It is shown that this form determines the isotropy behavior and the isometry class of generalized quadratic forms.
متن کاملDiscriminant Projective Non-Negative Matrix Factorization
Projective non-negative matrix factorization (PNMF) projects high-dimensional non-negative examples X onto a lower-dimensional subspace spanned by a non-negative basis W and considers W(T) X as their coefficients, i.e., X≈WW(T) X. Since PNMF learns the natural parts-based representation Wof X, it has been widely used in many fields such as pattern recognition and computer vision. However, PNMF ...
متن کاملNew algorithm for polynomial spectral factorization with quadratic convergence. II
It is known that two cases of the polynomial spectral factorization are used in applications: the polynomial "discrete" spectral factorization (s) cp( — s) and all roots of the polynomial cp(s) have nonpositive real parts. It is suppos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1987
ISSN: 0025-5718
DOI: 10.2307/2007842